A Distributed Randomized Gradient-Free Algorithm for the Non-Convex Economic Dispatch Problem
نویسندگان
چکیده
منابع مشابه
Non-Convex Economic Dispatch of a Virtual Power Plant via a Distributed Randomized Gradient-Free Algorithm
Abstract: The economic dispatch problem of a virtual power plant (VPP) is becoming non-convex for distributed generators’ characteristics of valve-point loading effects, prohibited operating zones, and multiple fuel options. In this paper, the economic dispatch model of VPP is established and then solved by a distributed randomized gradient-free algorithm. To deal with the non-smooth objective ...
متن کاملInitialization-free Privacy-guaranteed Distributed Algorithm for Economic Dispatch Problem
This paper considers the economic dispatch problem for a network of power generators and customers. In particular, our aim is to minimize the total generation cost under the power supply-demand balance and the individual generation capacity constraints. This problem is solved in a distributed manner, i.e., a dual gradient-based continuous-time distributed algorithm is proposed in which only a s...
متن کاملAn Intelligent Approach Based on Meta-Heuristic Algorithm for Non-Convex Economic Dispatch
One of the significant strategies of the power systems is Economic Dispatch (ED) problem, which is defined as the optimal generation of power units to produce energy at the lowest cost by fulfilling the demand within several limits. The undeniable impacts of ramp rate limits, valve loading, prohibited operating zone, spinning reserve and multi-fuel option on the economic dispatch of practical p...
متن کاملA social spider algorithm for solving the non-convex economic load dispatch problem
Economic Load Dispatch (ELD) is one of the essential components in power system control and operation. Although conventional ELD formulation can be solved using mathematical programming techniques, modern power system introduces new models of the power units which are non-convex, non-differentiable, and sometimes non-continuous. In order to solve such non-convex ELD problems, in this paper we p...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energies
سال: 2018
ISSN: 1996-1073
DOI: 10.3390/en11010244